Cost Sharing Network Routing Game
نویسنده
چکیده
To fix ideas, we can think of the graph as a public transportation network, where each edge represents a bus route connecting two stations. The n players can be thought of as employees that want to commute from their home stations si to a company located at station t. Assume that the operation of each route requires a fixed amount of money, say one unit of cost, which people using that route can share. Now, the natural objective of each employee is to find a path that minimizes his commuting expenses.
منابع مشابه
Robotics Nearest Neighbor Interchange and Related Distances
More and more research effort has been done to study the non-cooperative games recently. Among these various forms of games, the unicast/multicast routing game [2,5,6] and multicast cost sharing game [1,3,4] have received a considerable amount of attentions over the past few year due to its application in the Internet. However, both unicast/multicast routing game and multicast cost sharing game...
متن کاملThe Price of Anarchy (POA) of network coding and routing based on average pricing mechanism
The congestion pricing is an efficient allocation approach to mediate demand and supply of network resources. Different from the previous pricing using Affine Marginal Cost (AMC), we focus on studying the game between network coding and routing flows sharing a single link when users are price anticipating based on an Average Cost Sharing (ACS) pricing mechanism. We characterize the worst-case e...
متن کاملA JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملCooperative vehicle routing problem: an opportunity for cost saving
In this paper, a novel methodology is proposed to solve a cooperative multi-depot vehicle routing problem. We establish a mathematical model for multi-owner VRP in which each owner (i.e. player) manages single or multiple depots. The basic idea consists of offering an option that owners cooperatively manage the VRP to save their costs. We present cooperative game theory techniques for cost savi...
متن کاملCAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip
By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...
متن کامل